Process Realizability
نویسندگان
چکیده
منابع مشابه
Process Realizability
We develop a notion of realizability for Classical Linear Logic based on a concurrent process calculus.
متن کاملMonitoring Realizability
We present a new multi-valued monitoring approach for linear-time temporal logic that classifies trace prefixes not only according to the existence of correct and erroneous continuations, but also according to the strategic power of the system and its environment to avoid or enforce a violation of the specification. We classify the monitoring status into four levels: (1) the worst case is a vio...
متن کاملLinear Realizability
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also define a category of assemblies as well as a category of modest sets which are realized by rLCA. This is a linear style of realizability in a way that duplicating and discarding of realizers is allowed in a controlled way....
متن کاملRealizability Analysis 1 Running head: REALIZABILITY ANALYSIS Realizability Analysis of Top-down Web Service Composition Specifications
A conversation protocol specifies the desired global behaviors of a web service composition in a top-down fashion. Before implementing a conversation protocol, its realizability has to be determined, i.e., can a bottom-up web service composition be synthesized so that it generates exactly the same set of conversations as specified by the protocol? This chapter presents three sufficient conditio...
متن کاملAll realizability is relative
We introduce a category of basic combinatorial objects, encompassing PCAs and locales. Such a basic combinatorial object is to be thought of as a pre-realizability notion. To each such object we can associate an indexed preorder, generalizing the construction of triposes for various notions of realizability. There are two main results: first, the characterization of triposes which arise in this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1999
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00099-4